• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
تعداد ۲ پاسخ غیر تکراری از ۲ پاسخ تکراری در مدت زمان ۰,۶۷ ثانیه یافت شد.

1. Aufzahlbarkeit, Entscheidbarkeit, Berechenbarkeit; Einfuhrung in die Theorie der rekursiven Funktionen

  • اطلاعات استناد دهی
  • BibTex
  • RIS
  • Endnote
  • Refer

Author: Hermes, Hans.

Library: Central Library of Sharif University of Technology (Tehran)

Subject: ، Recursive functions,، Algorithms,، Godel's theorem,، Computable functions

Classification :
QA
248
.
5
.
H4
1971

2. Enumerability, decidability, computability; an introduction to the theory of recursive functions

  • اطلاعات استناد دهی
  • BibTex
  • RIS
  • Endnote
  • Refer

Author: / by Hans Hermes. Translated by G.T Herman and O. Plassmann

Library: Library of College of Science University of Tehran (Tehran)

Subject: Recursive functions,Algorithms,Godel's theorem,Computable functions

Classification :
QA
248
.
5
.
H413
  • »
  • 1
  • «

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival